Dynamic Study of Double Layer Lattice Domes
نویسندگان
چکیده
منابع مشابه
METAHEURISTIC-BASED SIZING AND TOPOLOGY OPTIMIZATION AND RELIABILITY ASSESSMENT OF SINGLE-LAYER LATTICE DOMES
Economy and safety are two important components in structural design process and stablishing a balance between them indeed results in improved structural performance specially in large-scale structures including space lattice domes. Topology optimization of geometrically nonlinear single-layer lamella, network, and geodesic lattice domes is implemented using enhanced colliding-bodies optimizati...
متن کاملSphere Packing for Regularisation of Lattice Domes
The paper provides a methodology for finding a family of patterns for lattice domes, created based on the “Surface Sphere Packing” concept. The patterns have a high degree of regularity in the sense of a high percentage of the elements being of the same length. Also, parametric formulation for generating such patterns are discussed. This gives an opportunity for creating more regular patterns w...
متن کاملLattice-Gas Models of Adsorption in the Double Layer
The theory of statistical-mechanical lattice-gas modeling of adsorption is reviewed and shown to be applicable to a range of electrochemical problems dominated by effective, lateral adsorbate–adsorbate interactions. A general strategy for applying the method to specific systems is outlined, which includes microscopic model formulation, calculation of zero-temperature phase diagrams, numerical c...
متن کاملDouble-layer Modificatory Linguistic Truth-value Lattice-valued Evaluation Method
In this paper, a double-layer modificatory linguistic truth-value lattice-valued evaluation method is presented. Its logic basic is based on modificatory linguistic truth-value lattice-valued proposition logic system MLTVLP(X) and operator modificatory linguistic truth-value lattice-valued proposition logic OMLTVLP(X). MLTVLP(X) and OMLTVLP(X) are similar to LTVLP(X) and MLTVLP(X), which have b...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in Applied Sciences Research
سال: 2012
ISSN: 1819-3579
DOI: 10.3923/tasr.2012.221.230